Disjoint Color-Avoiding Triangles
نویسندگان
چکیده
منابع مشابه
Disjoint Color-Avoiding Triangles
A set of pairwise edge-disjoint triangles of an edge-colored Kn is r-color avoiding if it does not contain r monochromatic triangles, each having a different color. Let fr(n) be the maximum integer so that in every edge coloring of Kn with r colors, there is a set of fr(n) pairwise edge-disjoint triangles that is r-color avoiding. We prove that 0.1177n2(1 − o(1)) < f2(n) < 0.1424n2(1 + o(1)). T...
متن کاملThe Vertex-Disjoint Triangles Problem
The vertex-disjoint triangles (VDT) problem asks for a set of maximum number of pairwise vertex-disjoint triangles in a given graph G. The triangle cover problem asks for the existence of a perfect triangle packing in a graph G. It is known that the triangle cover problem is NPcomplete on general graphs with clique number 3 [6]. The VDT problem is MAX SNP-hard on graphs with maximum degree four...
متن کاملPacking Edge-Disjoint Triangles in Given Graphs
Given a graph G, we consider the problem of finding the largest set of edge-disjoint triangles contained in G. We show that even the simpler case of decomposing the edges of a sparse split graph G into edge-disjoint triangles is NP-complete. We show next that the case of a general G can be approximated within a factor of 3 5 in polynomial time, and is NP-hard to approximate within some constant...
متن کاملDisjoint triangles and pentagons in a graph
Let n, s, and t be integers with s ≥ 1, t ≥ 0, and n = 3s + 5t. Let G be a graph of order n such that the minimum degree of G is at least (n + s + t)/2. Then G contains s + t independent subgraphs such that s of them are triangles and t of them are pentagons.
متن کاملPacking interval graphs with vertex-disjoint triangles
We show that there exists a polynomial algorithm to pack interval graphs with vertex-disjoint triangles.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2009
ISSN: 0895-4801,1095-7146
DOI: 10.1137/060666664